NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
561	CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Approximation algorithm Computational complexity theory Facility location Circle Travelling salesman problem Tower of Hanoi Theoretical computer science Geometry Mathematics
562	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximating Full Steiner Tree in a Unit Disk Graph Ahmad Biniaz∗ Anil Maheshwari∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-18 15:41:52 NP-complete problems Steiner tree problem Spanning tree Tree Graph Graph coloring Matroid theory Quasi-bipartite graph Minimum spanning tree Graph theory Theoretical computer science Mathematics
563	A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-08-05 21:28:00 NP-complete problems Combinatorial optimization 2-satisfiability Independent set Matching Automatic label placement Algorithm Dominating set Partial cube Theoretical computer science Mathematics Graph theory
564	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:48 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
565	DEPARTAMENTO DE COMPUTACION Facultad de Ciencias Exactas y Naturales - UBA Universidad de Buenos Aires Facultad de Ciencias Exactas y Naturales Add to Reading List Source URL: dc.uba.ar Language: English - Date: 2013-03-19 08:15:12 Morphisms NP-complete problems Graph operations Graph isomorphism Combinatorial optimization Graph Bipartite graph Cograph Tree Graph theory Mathematics Theoretical computer science
566	Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-07-08 12:40:54 NP-complete problems Operations research Combinatorial optimization Bin packing problem Knapsack problem Packing problem Algorithm Theoretical computer science Computational complexity theory Mathematics
567	CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:32:58 NP-complete problems Delaunay triangulation Triangulation Maximum flow problem Cut Shortest path problem Graph theory Mathematics Theoretical computer science
568	Learning Attack Strategies from Intrusion Alerts ∗ Peng Ning Add to Reading List Source URL: discovery.csc.ncsu.edu Language: English - Date: 2011-11-09 13:26:02 NP-complete problems Morphisms Alert correlation Graph isomorphism Subgraph isomorphism problem Matching Tree Mathematics Theoretical computer science Graph theory
569	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.dcs.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes
570	A note on the path graph of a set of points in convex position in the plane Eduardo Rivera-Campo and Virginia Urrutia-Galicia Extended abstract 1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:02:06 NP-complete problems Tree Hamiltonian path

UPDATE